Balanced Line for a 3-Colored Point Set in the Plane

نویسندگان

  • Sergey Bereg
  • Mikio Kano
چکیده

In this note we prove the following theorem. For any three sets of points in the plane, each of n ≥ 2 points such that any three points (from the union of three sets) are not collinear and the convex hull of 3n points is monochromatic, there exists an integer k ∈ {1, 2, . . . , n− 1} and an open half-plane containing exactly k points from each set.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Optimal Algorithm for Plane Matchings in Multipartite Geometric Graphs

Let P be a set of n points in general position in the plane which is partitioned into color classes. P is said to be color-balanced if the number of points of each color is at most bn/2c. Given a color-balanced point set P , a balanced cut is a line which partitions P into two colorbalanced point sets, each of size at most 2n/3+1. A colored matching of P is a perfect matching in which every edg...

متن کامل

Balanced partitions of 3-colored geometric sets in the plane

Let S be a finite set of geometric objects partitioned into classes or colors. A subset S′ ⊆ S is said to be balanced if S′ contains the same amount of elements of S from each of the colors. We study several problems on partitioning 3colored sets of points and lines in the plane into two balanced subsets: (a) We prove that for every 3-colored arrangement of lines there exists a segment that int...

متن کامل

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

On balanced 4-holes in bichromatic point sets

Let S = R∪B be a set of n points in general position in the plane. The elements of R and B will be called, respectively, the red and blue elements of S. A k-hole of S is a simple polygon with k vertices, all in S, and containing no element of S in its interior. A 4-hole of S is balanced if it has two blue and two red vertices. In this paper, we characterize the set of bicolored points S = R∪B t...

متن کامل

Miniaturized High-Pass Filter Based on Balanced Composite Right-Left Handed Transmission Line Using Meander Spiral Complementary Split Ring Resonators

In this paper, a compact high-pass filter (HPF) with a sharp rejection response based on the balanced composite right-left handed (CRLH) transmission line (TL) concept is proposed. A series LC resonator using an interdigital capacitor and meander lines is designed. Also, a meander spiral complementary split ring resonator (MSCSRR) is used to realize the parallel LC resonator. The high-pass filt...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2012